Multiple Binary Trees Encryption Principle
نویسنده
چکیده
Through block cipher method, this paper demonstrates using preorder and post traversal sequence of a binary tree with 64 nodes to implement symmetric encryption/decryption. The different traversal sequences may determine a binary tree, so the method is vulnerable to be attacked. The paper’s further deduction involves improvement using multiple binary trees, so that more secure and efficient symmetric encryption algorithms can be obtained.
منابع مشابه
Proposing an effective approach for Network security and multimedia documents classically using encryption and watermarking
Local binary pattern (LBP) operators, which measure the local contrast within a pixel's neighborhood, successfully applied to texture analysis, visual inspection, and image retrieval. In this paper, we recommend a semi blind and informed watermarking approach. The watermark has been built from the original image using Weber Law. The approach aims is to present a high robustness and imperceptibi...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملOn Defining Functions on Binary Trees
This article is a continuation of an article on defining functions on trees (see [6]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars. We recast the induction principle for the set of parse trees of binary grammars and the scheme of defining functions inductively with the set as domain. We conclude with defining the scheme of...
متن کاملOn Defining Functions on Binary Trees1
This article is a continuation of an article on defining functions on trees (see [6]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars. We recast the induction principle for the set of parse trees of binary grammars and the scheme of defining functions inductively with the set as domain. We conclude with defining the scheme of...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کامل